#include<iostream>
#include<vector>
using namespace std;
class Solution {
public:
    int findMin(vector<int>& nums) {
        int left = 0;
        int right = nums.size() - 1;
        int flag = nums[right];
        while (left < right) {
            int mid = left + (right - left) / 2;
            if (nums[mid] > flag) {
                left = mid + 1;
            }
            else
                right = mid;
        }
        return nums[left];
    }
};
int main()
{
	return 0;
}